Low Complexity Algorithms for Robust Multigroup Multicast Beamforming
نویسندگان
چکیده
منابع مشابه
Low-Complexity Reduced-Rank Beamforming Algorithms
A reduced-rank framework with set-membership filtering (SMF) techniques is presented for adaptive beamforming problems encountered in radar systems. We develop and analyze stochastic gradient (SG) and recursive least squares (RLS)-type adaptive algorithms, which achieve an enhanced convergence and tracking performance with low computational cost as compared to existing techniques. Simulations s...
متن کاملLow-Complexity Robust Adaptive Beamforming Algorithms Based on Shrinkage for Mismatch Estimation
In this paper, we propose low-complexity robust adaptive beamforming (RAB) techniques that based on shrinkage methods. The only prior knowledge required by the proposed algorithms are the angular sector in which the actual steering vector is located and the antenna array geometry. We firstly present a Low-Complexity ShrinkageBased Mismatch Estimation (LOCSME) algorithm to estimate the desired s...
متن کاملData-Adaptive Reduced-Dimension Robust Beamforming Algorithms
We present low complexity, quickly converging robust adaptive beamformers that combine robust Capon beamformer (RCB) methods and data-adaptive Krylov subspace dimensionality reduction techniques. We extend a recently proposed reduced-dimension RCB framework, which ensures proper combination of RCBs with any form of dimensionality reduction that can be expressed using a full-rank dimension reduc...
متن کاملLow-Complexity Uncertainty Set Based Robust Adaptive Beamforming for Passive Sonar
Recent work has highlighted the potential benefits of exploiting ellipsoidal uncertainty set based robust Capon beamformer (RCB) techniques in passive sonar. Regrettably, the computational complexity of forming RCB weights is cubic in the number of adaptive degrees of freedom, which is often prohibitive in practice. For this reason, several low-complexity techniques for computing RCB weights, o...
متن کاملLow-complexity adaptive step size constrained constant modulus SG algorithms for adaptive beamforming
This paper proposes two low-complexity adaptive step size mechanisms for adaptive beamforming that employs stochastic gradient (SG) algorithms. The algorithms employ the constrained constant modulus (CCM) criterion as the design approach. A complexity comparison is given and a convergence analysis is developed for illustrating their properties. Theoretical expressions of the excess mean squared...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2019
ISSN: 1089-7798,1558-2558,2373-7891
DOI: 10.1109/lcomm.2019.2917431